Effect of adding edges to consensus networks with directed acyclic graphs

Title: Effect of adding edges to consensus networks with directed acyclic graphs
Creator: Zhang, Hai-Tao; Chen, Zhiyong; Mo, Xiaoyu
Relation: Funding BodyARCGrant NumberDP150103745 http://purl.org/au-research/grants/arc/DP150103745
Relation: IEEE Transactions on Automatic Control Vol. 62, Issue 9, p. 4891-4897
Publisher Link: http://dx.doi.org/10.1109/TAC.2017.2692527
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Resource Type: journal article
Date: 2017
Description: Consensus of a network with a directed acyclic graph, a directed graph with no directed cycles, is always guaranteed if it contains a spanning tree. This paper studies the effect of adding edges to a directed acyclic graph that may result in a directed cycle. It is shown that the effect on consensus performance of the whole network is only determined by a local subnetwork containing all the added edges. More specifically, both a one-dimensional (1-D) chain network and a 2-D grid network are investigated in this paper. It is proved that, when a reverse edge is added, the consensus performance is degraded by the amount only determined by the edge range, that is, independent of the network size or the location of the added edge.
Subject: complex networks; consensus; directed acyclic graph (DAG); Laplacian; multiagent system
Identifier: http://hdl.handle.net/1959.13/1386825
Identifier: uon:32471
Identifier: ISSN:0018-9286
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format